Two alternatives for disjunction: an inquisitive reconciliation∗
نویسنده
چکیده
Traditionally, disjunction is taken to express an operator that takes two propositions A and B, and yields their join, A∪B. In more recent work, however, it has been argued that disjunction should rather be treated as generating a set of propositions, {A,B}. Each of the two approaches has certain vantage points that the other one lacks. Thus, it would be desirable to reconcile the two, combining their respective strengths. This paper shows that this is indeed possible, if we adopt a notion of meaning that does not just take informative content into consideration, but also inquisitive content.
منابع مشابه
Hurford ’ s constraint , the semantics of disjunction , and the nature of alternatives ∗ Ivano Ciardelli and Floris Roelofsen
This paper contributes to two recent lines of work on disjunction: on the one hand, work on so-called Hurford disjunctions, i.e., disjunctions where one disjunct entails another, and on the other hand, work in alternative and inquisitive semantics where disjunction has been argued to generate multiple propositional alternatives. We point out that Hurford effects are found not only in disjunctiv...
متن کاملInquisitive Semantics: Two Possibilities for Disjunction
We introduce an inquisitive semantics for a language of propositional logic, where the interpretation of disjunction is the source of inquisitiveness. Indicative conditionals and conditional questions are treated on a par both syntactically and semantically. The semantics comes with a new logical-pragmatical notion which judges and compares the compliance of responses to an initiative in inquis...
متن کاملA generalized inquisitive semantics.∗
In Inquisitive Semantics, formulas are evaluated on ordered pairs of indices; actually, the order of the pair is irrelevant, so these pairs could just just as well be taken to be non-empty sets of indices of cardinality at most two. This last restriction, however, sounds particularly unnatural, especially considering that the definition of inquisitive semantics can be easily reformulated in suc...
متن کاملUniform Definability in Propositional Dependence Logic
Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) transl...
متن کاملAlgebraic foundations for the semantic treatment of inquisitive content
In classical logic, the proposition expressed by a sentence is construed as a set of possible worlds, capturing the informative content of the sentence. However, sentences in natural language are not only used to provide information, but also to request information. Thus, natural language semantics requires a logical framework whose notion of meaning does not only embody informative content, bu...
متن کامل